Stochastic Relations: Foundations for Markov Transition Systems Ernst-Erich Doberkat Conceptual Structures in Practice Pascal Hitzler and Henrik Schärfe Context-Aware Computing and Self-Managing Systems

نویسندگان

  • Waltenegus Dargie
  • Victor W. Marek
  • Timothy K. Shih
  • G. Q. Zhang
  • Qing Li
چکیده

syntax notation one (ASN.1),85, 86, 100, 104Accessibility, 98, 302, 362Acronym newsputer, 200Active knowledge, 197−210Ad hoc PSN, 96, 124Adaptive and intelligent educationalsystems (AIES), 359Adaptive hypermedia (AH), 355,357−359, 367, 369Adaptive navigation support, 357, 359Advanced distributed learningconsortium (ADL), 362Alerting mechanism, 323, 329, 332,335, 336ALM protocol, 12, 19, 20Analog-to-digital converter (ADC),97, 139Ancestor peer, 28Antenna, 89, 139, 186, 303, 325, 326ASN.1, 85, 86, 100, 104, 108, 124Associated child peers, 28Asymmetric MSS, 45Audio codec, 77, 78, 87, 91Augmented reality, 153−165Average vote-weighted averagevote, 254Average-median (AVG), 254

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Nondeterminism and Effectivity Functions

This paper investigates stochastic nondeterminism by relating nondeterministic labelled Markov processes and stochastic effectivity functions to each other; the underlying state spaces are continuous. Both generalizations to labelled Markov transition systems have been proposed recently with differing intentions. It turns out that they display surprising similarities and interesting differences...

متن کامل

Factoring stochastic relations

When a system represented through a stochastic model is observed, the equivalence of behavior is described through the observation that equivalent inputs lead to equivalent outputs. This paper has a look at the systems that arise when the stochastic model is factored through the congruence. Congruences may refine each other, and we show that this refinement is reflected through factoring. We al...

متن کامل

Derandomizing probabilistic semantics through Eilenberg-Moore algebras for the Giry monad

A simple language is defined, a probabilistic semantics and a partial correctness logic is proposed in terms of probabilistic relations. It is shown how a derandomized semantics can be constructed through the Eilenberg-Moore algebras. We investigate the category of EilenbergMoore algebras for the Giry monad associated with stochastic relations over Polish spaces with continuous maps as morphism...

متن کامل

Characterizing the Eilenberg-Moore Algebras for a Monad of Stochastic Relations

We investigate the category of Eilenberg-Moore algebras for the Giry monad associated with stochastic relations over Polish spaces with continuous maps as morphisms. The algebras are characterized through convex partitions of the space of all probability measures. Examples are investigated, and it is shown that finite spaces usually do not have algebras at all.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009